Knowledge how, ability, and the type-token distinction
نویسنده
چکیده
This paper examines the relationship between knowing how to G and the ability to G, which is typically presented in one of the following ways: (a) knowing how to G entails the ability to G; (b) knowing how to G does not entail the ability to G. In an attempt to reconcile these two putatively opposing positions, I distinguish between type and token actions. It is my contention that S can know how to G in the absence of an ability to Gtoken, where this action is derived from an actiontype, but not in the absence of the ability to perform the action-type itself (Gtype). This refinement is an attempt to reconcile differences between intellectualism and anti-intellectualism (broadly construed) with regard to knowledge how and ability.
منابع مشابه
Temporal Entities - Types, Tokens and Qualifications
Reified logics have been a major subject of interest in the knowledge representation community for well over twenty years, since over the years, the need to quantify and reason about propositional entities such as events and states among other temporal entities has grown. Galton had made it clear that one may either refer to types or tokens (instances) of such entities in the ontology. A clear ...
متن کاملOn the Nature of the Instantiation Relation
When addressing the type-token distinction and the problem of universals, an ontological theory will often allude to an instantiation relation. This relation is said to hold between a type and its corresponding token (instance), but is often not specified beyond this description. In this paper, we examine the nature of the instantiation relation in its various philosophical guises. One of the c...
متن کاملOn the expressive limits of reified theories
Reified theories have been used widely in knowledge representation. From an ontological perspective, reification involve populating the ontology with event or property types and tokens. While type reification has been used in many works, it has been criticized as being philosophically unsound, and token reification has been advocated in its place by Galton. In this paper, we take the position o...
متن کاملAn Improved Token-Based and Starvation Free Distributed Mutual Exclusion Algorithm
Distributed mutual exclusion is a fundamental problem of distributed systems that coordinates the access to critical shared resources. It concerns with how the various distributed processes access to the shared resources in a mutually exclusive manner. This paper presents fully distributed improved token based mutual exclusion algorithm for distributed system. In this algorithm, a process which...
متن کاملHow is the result of the categorization process represented?
How is the outcome of the categorization process represented? This question has gone virtually unaddressed. A notable exception is Barsalou (2012) which proposes that categorization results in a type–token predication, whereby the type representation (e.g. DOG) is predicated of the token representation of the categorized individual (e.g. Fido). Another is Jackendoff (1983) which proposes that c...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Synthese
دوره 194 شماره
صفحات -
تاریخ انتشار 2017